Challenges Implementing an LCF-Style Proof System with Haskell
نویسنده
چکیده
The predominant, root design among current proof assistants, the LCF style, is traditionally realized through impure, functional languages. Thus, languages that eschew side-effects in the name of purity collectively represent a largely untapped platform for exploring alternate implementations of LCF-style provers. The work in this paper details the challenges we have encountered in the development of one such implementation, a monadic approach to the LCF style tailored to the Haskell programming language. The resultant proof system, HaskHOL, is introduced and our current work with it is briefly discussed.
منابع مشابه
Mosquito: an implementation of higher-order logic
We present Mosquito: an experimental stateless, pure, largely total lcf-style implementation of higher-order logic using Haskell as a metalanguage. We discuss details of the logic implemented, kernel design and novel proof state and tactic representations. Mosquito is an experimental lcf-style implementation of higher-order logic (hol) using Haskell as its metalanguage. The system is under acti...
متن کاملFast LCF-Style Proof Reconstruction for Z3
The Satisfiability Modulo Theories (SMT) solver Z3 can generate proofs of unsatisfiability. We present independent reconstruction of these proofs in the theorem provers Isabelle/HOL and HOL4 with particular focus on efficiency. Our highly optimized implementations outperform previous LCF-style proof checkers for SMT, often by orders of magnitude. Detailed performance data shows that LCF-style p...
متن کاملPropositional Simplification With BDDs and SAT Solvers
We show how LCF-style interactive theorem provers might use BDD engines and SAT solvers to perform normalization, simplification of terms and theorems, and assist with interactive proof. The treatment builds on recent work integrating SAT solvers as non-trusted decision procedures for LCF-style theorem provers. We limit ourselves to propositional logic, but briefly note that the results may be ...
متن کاملLCF-Style Bit-Blasting in HOL4
This paper describes a new proof tool for deciding bit-vector problems in HOL4. The approach is based on “bit-blasting”, wherein word expressions are mapped into propositional formulas, which are then handed to a SAT solver. Significantly, the implementation uses the LCF approach, which means that the soundness of the tool is guaranteed by the soundness of HOL4’s logical kernel.
متن کاملThe Hol Logic Extended with Quantiication over Type Variables
The HOL system is an LCF-style mechanized proof-assistant for conducting proofs in higher order logic. This paper discusses a proposal to extend the primitive basis of the logic underlying the HOL system with a very simple form of quantiication over types. It is shown how certain practical problems with using the deenitional mechanisms of HOL would be solved by the additional expressive power g...
متن کامل